Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
111	Numeric Bounds Analysis with Conflict-Driven Learning? Vijay D’Silva?? , Leopold Haller, Daniel Kroening, and Michael Tautschnig Computer Science Department, University of Oxford Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2012-07-25 13:39:19 Applied mathematics Electronic design automation Formal methods Logic in computer science NP-complete problems Valuation Boolean satisfiability problem Local consistency Abstract interpretation Theoretical computer science Constraint programming Mathematics
112	Saturn: A Scalable Framework for Error Detection using Boolean Satisfiability Yichen Xie and Alex Aiken Stanford University This article presents Saturn, a general framework for building precise and scalable static error Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2006-08-21 19:57:13 Formal methods Boolean algebra Symbol Entailment Interpretation Boolean satisfiability problem Logic Theoretical computer science Model theory
113	HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars ADAM KIEZUN, Brigham and Women’s Hospital / Harvard Medical School VIJAY GANESH, Massachusetts Institute of Technology SHA Add to Reading List Source URL: pgbovine.net Language: English - Date: 2014-01-03 23:24:44 Theoretical computer science SQL injection SQL Hampi Context-free grammar String Constraint programming Boolean satisfiability problem Formal grammar Formal languages Computing Software engineering
114	Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-04-13 00:26:28 NP-complete problems Automated theorem proving Constraint programming Boolean algebra Formal methods DPLL algorithm Boolean satisfiability problem Conjunctive normal form Lookup table Theoretical computer science Applied mathematics Mathematics
115	Bound Propagation for Arithmetic Reasoning in Vampire Ioan Dragan∗ , Konstantin Korovin † , Laura Kov´acs ‡ , Andrei Voronkov † ∗ Vienna University of Technology Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2013-12-12 08:44:35 Operations research Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories Linear programming Local consistency Theoretical computer science Applied mathematics Mathematics
116	A New Approach to Model Counting Wei Wei and Bart Selman Department of Computer Science Cornell University Ithaca, NY 14853 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-06-09 16:20:27 Constraint programming Logic in computer science Boolean algebra Automated theorem proving Mathematical logic Boolean satisfiability problem DPLL algorithm Local search Davis–Putnam algorithm Theoretical computer science Applied mathematics Mathematics
117	Reasoning About the Unknown in Static Analysis Isil Dillig Thomas Dillig Alex Aiken {isil, tdillig, aiken}@cs.stanford.edu Computer Science Department Stanford University Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-01-25 02:22:18 Logic in computer science Boolean algebra Formal methods Function Constructible universe Net Boolean satisfiability problem Canonical form Normal distribution Mathematics Mathematical logic Theoretical computer science
118	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory
119	Lifted MAP Inference for Markov Logic Networks Somdeb Sarkhel, Deepak Venugopal Department of Computer Science The University of Texas at Dallas Richardson, TX 75080, USA Add to Reading List Source URL: www.hlt.utdallas.edu Language: English - Date: 2014-02-25 21:05:55 Propositional calculus Theoretical computer science Boolean algebra Artificial intelligence Markov logic network Propositional variable Resolution Boolean satisfiability problem First-order logic Logic Mathematical logic Mathematics
120	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics

UPDATE